Termination Proof Script
Consider the TRS R consisting of the rewrite rules
|
| 1: |
|
0 + y |
→ y |
| 2: |
|
s(x) + 0 |
→ s(x) |
| 3: |
|
s(x) + s(y) |
→ s(s(x) + (y + 0)) |
|
There are 2 dependency pairs:
|
| 4: |
|
s(x) +# s(y) |
→ s(x) +# (y + 0) |
| 5: |
|
s(x) +# s(y) |
→ y +# 0 |
|
The approximated dependency graph contains one SCC:
{4}.
-
Consider the SCC {4}.
The constraints could not be solved.
Tyrolean Termination Tool (0.02 seconds)
--- May 4, 2006